Improved Circuit-to-CNF Transformation for SAT-based ATPG

نویسندگان

  • Daniel Tille
  • René Krenz-Bååth
  • Juergen Schloeffel
  • Rolf Drechsler
چکیده

SAT-based ATPG has proven to be a beneficial complement to traditional ATPG techniques. The generation of a CNF-representation is a vital issue in SAT-based test pattern generation. Firstly, the generation of the problem instances for SAT-based ATPG requires a significant portion of the overall runtime. Secondly, the performance of the SAT solver strongly depends on the properties of the resulting CNF-representation. The contribution of this paper is a new approach to generate CNF-representations for SAT-based ATPG. The objective of the proposed technique is to speed up the generation process and to optimize the resulting CNF-representation with respect to the SAT computation. The experimental results, obtained on large industrial designs, show that the accomplished optimizations result in a significant reduction of the overall runtime of the SAT-based test pattern generation process. Finally we discuss how this contribution enables some promising future work.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

High Fault Coverage ATPG for Industrial Application using DYNAMIC SAT Technique

It is a novel technique for automatic test pattern generation which well detects both easy to detect faults and hard to detect faults. ATPG based on this SAT technique dynamic clause activation (DCA) generates a limited number of test patterns which can cover more faults. ATPG based on implication graph have problems to cope with hard-todetect faults. ATPG based on Boolean satisfiability does n...

متن کامل

SAT-based Automatic Test Pattern Generation

Due to the rapidly growing size of integrated circuits, there is a need for new algorithms for Automatic Test Pattern Generation (ATPG). While classical algorithms reach their limit, there have been recent advances in algorithms to solve Boolean Satisfiability (SAT). Because Boolean SAT solvers are working on Conjunctive Normal Forms (CNF), the problem has to be transformed. During transformati...

متن کامل

Speeding up SAT Based ATPG for Logic Veri cation by Recursive Learning

Recursive Learning (RL) is a circuit-structure-based method for computing all necessary assignments. Recursive learning technique can be combined with diierent CAD algorithms and techniques in testing, veriication and optimization. In particular, it is used for Automatic test pattern generation(ATPG) which has been applied to many areas of logic synthesis and formal veriication including combin...

متن کامل

Design Error Diagnosis Based on Verification Techniques

Error diagnosis is becoming more difficult in VLSI circuit designs due to the increasing complexity. In this paper, we present an algorithm based on verification for improving the accuracy of design error diagnosis. This algorithm integrates three-valued logic simulation and Boolean satisfiability(SAT). It uses test patterns generated by gate level stuck-at fault ATPG tool for parallel pattern ...

متن کامل

Studies on Integrating SAT-based ATPG in an Industrial Environment

Due to ever increasing design sizes, more efficient tools for Automatic Test Pattern Generation (ATPG) are needed. Recently, SAT-based approaches for test pattern generation have been shown to be very efficient even on large industrial circuits. But these SAT-based techniques are not always superior to classical ATPG approaches. An integration of SAT-based engines into the classical ATPG flow c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008